The $$(1+1)$$ ( 1 + 1 ) Elitist Black-Box Complexity of LeadingOnes
نویسندگان
چکیده
منابع مشابه
Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes
We show that the unrestricted black-box complexity of the n-dimensional XORand permutation-invariant LeadingOnes function class is O(n log(n)/ log logn). This shows that the recent natural looking O(n logn) bound is not tight. The black-box optimization algorithm leading to this bound can be implemented in a way that only 3-ary unbiased variation operators are used. Hence our bound is also vali...
متن کاملIntroducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and other search heuristics and serves as an inspiration for the design of new genetic algorithms. Several black-box models covering different classes of algorithms exist, each highlighting a different aspect of the algorithms under considerations. In this work we add to the ex...
متن کاملThe Complexity of Black-Box Ring Problems
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum algorithms for several natural computatio...
متن کاملMemory-Restricted Black-Box Complexity
We show that the black-box complexity with memory restriction one of the n-dimensional OneMax function class is at most 2n. This disproves the Θ(n log n) conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006) 525–544).
متن کاملOn Black-Box Complexity of UC Security
In this work, we study the intrinsic complexity of black-box UC secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the CRS model (and related setups). Our results involve the following: • Static UC secure computation. Designing the first static UC secure oblivious transfer protocol based on public-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0304-6